Counting Lattice Animals: A Parallel Attack
نویسندگان
چکیده
A parallel algorithm for the enumeration of isolated connected clusters on a regular lattice is presented. The algorithm has been implemented on 17 RISCbased workstations to calculate the perimeter polynomials for the plane triangular lattice up to clustersize s = 21. New data for perimeter polynomials D s up to D21, total number of clusters gs up to g22, and coefficients b~ in the low-density series expansion of the mean cluster size up to b21 are given.
منابع مشابه
The Umbral Transfer-Matrix Method, III: Counting Animals
This is the third part of the five-part saga on the umbral transfermatrix method, based on Gian-Carlo Rota’s seminal notion of the umbra. In this article we describe the Maple package ZOO that for any specific k, automatically constructs an umbral scheme for enumerating “k-board” lattice animals (polyominoes) on the two-dimensional square lattice. Such umbral schemes enable counting these impor...
متن کاملCounting hexagonal lattice animals confined to a strip
We describe a bijection between hexagonal lattice animals and a special type of square lattice animals. Using this bijection we adopt Maple packages that automatically generates generating functions (and series expansions) for fixed square lattice lattice animals to that of fixed hexagonal animals on the two-dimensional hexagonal lattice confined to a strip 0 ≤ y ≤ k, for arbitrary k. In [Z1], ...
متن کاملEvaluation of two lattice Boltzmann methods for fluid flow simulation in a stirred tank
In the present study, commonly used weakly compressible lattice Boltzmann method and Guo incompressible lattice Boltzmann method have been used to simulate fluid flow in a stirred tank. For this purpose a 3D Parallel code has been developed in the framework of the lattice Boltzmann method. This program has been used for simulation of flow at different geometries such as 2D channel fluid flow an...
متن کاملParallel Enumeration of Shortest Lattice Vectors
Lattice basis reduction is the problem of finding short vectors in lattices. The security of lattice based cryptosystems is based on the hardness of lattice reduction. Furthermore, lattice reduction is used to attack well-known cryptosystems like RSA. One of the algorithms used in lattice reduction is the enumeration algorithm (ENUM), that provably finds a shortest vector of a lattice. We prese...
متن کاملCounting lattice animals in high dimensions
We present an implementation of Redelemeier’s algorithm for the enumeration of lattice animals in high-dimensional lattices. The implementation is lean and fast enough to allow us to extend the existing tables of animal counts, perimeter polynomials and series expansion coefficients in d-dimensional hypercubic lattices for 3 ≤ d ≤ 10. From the data we compute formulae for perimeter polynomials ...
متن کامل